OPEN: Object-oriented Process, Environment and Notation The ̄rst full lifecycle, third generation OO method

classesAbstractionAcceptance testingAccess analysisAccess path optimizationAction researchActive listeningActivity gridsAgents | see Intelligent agentsAggregation | see Composition structuresAnalysis of judgementsApproval gainingAssertion languageAssociationsAudit requirementsBeta testingBlackboardingBNFBrainstormingCD-ROM technologyCIRT IndexingClassi ̄cationClass internal designClass namingClustering (DB)ClustersCode generationCode/document inspectionsCohesion measuresCollaborationsCollapsing of classesColour in UIsCompletion of abstractionsComplexity measuresComposition Structures | aka AggregationComputer-Based Assessment (CBA)Con ̄guration managementConnascenceContainmentContext Modelling (BPR)Contract Speci ̄cationCost Bene ̄t Analysis (CBA) Henderson-Sellers 27Cost estimationCPM chartsCRC cardsCritical Success Factors (CSFs)Customer (on-site) trainingDatabase authorizationData°ow modelling (dangerous)DBMS product selectionDBMS type selectionDCS architecture speci ̄cation (partitioning and allocation)DCS optimizationDefect detectionDelegationDependency-based testingDescopingDialogue design in UIDiscriminantDomain analysisEarly prototype to exercise DCSEncapsulation/Information hidingER modelling (but take care)Event chartsEvent modellingException handlingExpected value analysisFagan's inspectionsFormal methodsFrameworksFunction pointsFuzzy logic and fuzzy modellingGamesGantt chartsGeneralization (see also Classi ̄cation)Generalization for reuseGenericity Speci ̄cationGQMGroup problem solvingHierarchical Task AnalysisHypergenericityIdiomsImpact analysisImpact estimation tableImplementation inheritanceImplementation of distributed aspects of system Henderson-Sellers 28Implementation of rulesImplementation of servicesImplementation of structureIndexingInformation engineering (but take care)Inspections | see Code/document inspections and Fagan's inspectionsIntegration testingIntelligent agentsInteraction modellingInternet and web technologyInterviewingKelly gridsLaw of DemeterLecturesLibrary Class incorporationLiterate programmingMapping to RDBMechanismsMetrics collectionMixinsMultiple inheritanceMVC analysisNormalizationObject lifecycle historiesObject replicationObject request brokers (ORBs)Object retention requirementsOwnership modellingPartitionsPassword protectionPath navigationPattern recognitionPERT chartsPetri netsPhysical securityPLanguagePolymorphismPower analysis (political systems analysis)Power typesPriority settingProcess modellingProject planningProtocol analysisPrototyping Henderson-Sellers 29PSPQuality templatesQuestionnairesRADRAD WorkshopsRecord and playbackRedundant associationsRe ̄nementRe ̄nement of inheritance hierarchiesRegression testingRelational DBMS interface speci ̄cationReliability requirementsRepeated inheritanceResponsibilitiesReuse metricsReverse engineeringRich picturesRisk AnalysisRôle assignmentRôle modellingRôleplayRule modellingScenario classesScreen painting and scrapingScriptingSecurity requirementsSelf-paced exercisesSemiotic modellingService Identi ̄cationSimulationSMART goalsSocial systems analysisSoft Systems AnalysisSpecialization inheritanceSpeci ̄cation inheritanceStandards complianceState machinesStatic analysisStatistical analysisStereotypesStorage of derived propertiesStoryboardingSubsystem co-ordinationSubsystem identi ̄cation Henderson-Sellers 30Subsystem testingTask cardsTask decompositionTask pointsTask scriptsTeam structuringTextual analysisThrowaway prototypingTime-threadsTQMTraceabilityTrain the trainerTraitsTransformations of the object modelTuning of databaseUnit testingUsability testingUsageUse casesVariant analysisVersioningVideotapingViewpointsVisibilityVisioning (for BPR)Visualization techniquesVolume analysisWalkthroughsWork°ow analysisWorkshopsWrappersZachman frameworks Henderson-Sellers 31Figure Legends Figure 1 A Method (or methodology) contains many elements, the three primary onesbeing lifecycle process, techniques and modelling language. Figure 2 Activities (with possibly sub-activities) have tasks which are realized by the useof one or more techniques. Figure 3 OML (OPEN Modelling Language) has two parts: the metamodel, derived as anextended version of the COMMA metamodel of Henderson-Sellers and Fire-smith [1997] and the notation, COMN (Common Object Modelling Notation)[Firesmith et al., 1997]. Figure 4 Contract-driven lifecycle process model [revised from Henderson-Sellers, Grahamet al., 1996] Figure 5 OOram's \Simple implementation process" [after Reenskaug et al., 1996]. Figure 6 The core of OPEN is a two-dimensional relationship between Tasks and Tech-niques. For each task, a number of techniques may be useful. For each com-bination of Task and Technique, an assessment can be made of the likelihoodof the occurrence of that combination. Some combinations can be identi ̄edas mandatory (M), others as recommended (R), some as being optional (O),some as unlikely/discouraged (D) and other combinations that are strictlyverboten (F = forbidden). Figure 7 Classes and drop down boxes. Figure 8 Relationships are indicated by arrows, some with adornments. The major rela-tionships are illustrated here and form part of the COMN Light notation. Henderson-Sellers 32Figure 9 A metamodel of the relationships between objects, types and classes which alsoillustrates the icons for each of these metatypes and also the icon for ClassImplementations. Figure 10 Example of specialization notation of COMN. Figure 11 In OPEN, associations are unidirectional mappings that preserve encapsulation[Graham et al., 1997]. The notation is a simple, directed arrow with optionallabel. Figure 12 Example of an aggregation (is-composed-of) relationship showing the appropriateCOMN notation. Figure 13 Example of a containing relationship showing the appropriate COMN notation. Figure 14 Metamodel of COMN relationships. These are binary, unidirectional dependencyrelationships which can be subdivided into de ̄nitional relationships, scenariorelationships, referential relationships and transitional relationships.